Approximate Delaunay mesh reconstruction and quality estimation from point samples
نویسندگان
چکیده
منابع مشابه
Tangent Estimation from Point Samples
Let M be an m-dimensional smooth compact manifold embedded in R, where m is a constant known to us. Suppose that a dense set of points are sampled from M according to a Poisson process with an unknown parameter. Let p be any sample point, let % be the local feature size at p, and let %ε be the distance from p to the (n + 1)th nearest sample point for some n between ( m+1 2 ) + 1 and ( d+1 2 ) ....
متن کاملParallel Guaranteed Quality Delaunay Uniform Mesh Refinement
We present a theoretical framework for developing parallel guaranteed quality Delaunay mesh generation software, that allows us to use commercial off-the-shelf sequential Delaunay meshers for two-dimensional geometries. In this paper, we describe our approach for constructing uniform meshes, in other words, the meshes in which all elements have approximately the same size. Our uniform distribut...
متن کاملTriangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
A b s t r a c t . Triangle is a robust implementation of two-dimensional constrained Delaunay triangulation and Ruppert's Delaunay refinement algorithm for quality mesh generation. Several implementation issues are discussed, including the choice of triangulation algorithms and data structures, the effect of several variants of the Delaunay refinement algorithm on mesh quality, and the use of a...
متن کاملRecent Progress in Robust and Quality Delaunay Mesh Generation
In this paper, some current issues of Delaunay mesh generation and optimization are addressed, with particular emphasis on the robustness of the meshing procedure and the quality of the resulting mesh. We also report new progress on the robust conforming and constrained boundary recovery in three dimensions, along with the quality mesh generation based on Centroidal Voronoi tessellations. Appli...
متن کاملQuality tetrahedral mesh smoothing via boundary-optimized Delaunay triangulation
Despite its great success in improving the quality of a tetrahedral mesh, the original optimal Delaunay triangulation (ODT) is designed to move only inner vertices and thus cannot handle input meshes containing "bad" triangles on boundaries. In the current work, we present an integrated approach called boundary-optimized Delaunay triangulation (B-ODT) to smooth (improve) a tetrahedral mesh. In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2015
ISSN: 0377-0427
DOI: 10.1016/j.cam.2014.07.001